Theory Exploration with Theorema
نویسنده
چکیده
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, namely logic programming. Amazingly, although proving is the essence of mathematics, the advances of automated theorem proving did not have any noticeable influence on the practice of mathematical research and teaching so far.
منابع مشابه
Theorema: Towards computer-aided mathematical theory exploration
Theorema is a project that aims at supporting the entire process of mathematical theory exploration within one coherent logic and software system. This survey paper illustrates the style of Theorema-supported mathematical theory exploration by a case study (the automated synthesis of an algorithm for the construction of Gröbner Bases) and gives an overview on some reasoners and organizational t...
متن کاملMathematical Theory Exploration in Theorema: Reduction Rings
In this paper we present the first-ever computer formalization of the theory of Gröbner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the formal verification of all results has already been fully completed by now; this, in particular, includes the generic implementation and correctness proof of Buch...
متن کاملTheorema 2.0: A System for Mathematical Theory Exploration
Theorema 2.0 stands for a re-design including a complete reimplementation of the Theorema system, which was originally designed, developed, and implemented by Bruno Buchberger and his Theorema group at RISC. In this talk, we want to present the current status of the new implementation, in particular the new user interface of the system.
متن کاملGroebner Bases in Theorema
In this talk we show how the theory of Groebner bases can be represented in the computer system Theorema, a system initiated by Bruno Buchberger in the mid-nineties. The main purpose of Theorema is to serve mathematical theory exploration and, in particular, automated reasoning. However, it is also an essential aspect of the Theorema philosophy that the system also provides good facilities for ...
متن کاملA Case Study in Systematic Theory Exploration: Natural Numbers
In this paper, we present a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger. We illustrate with examples from the exploration: (i) the invention of new concepts (functions, predicates) in the theory, using definition knowledge schemes, (ii) the invention of new propositions, ...
متن کاملInteractive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0
In this talk we will report on three useful tools recently implemented in the frame of the Theorema project: a graphical user interface for interactive proof development, a higher-order rewriting mechanism, and a tool for automatically analyzing the logical structure of Theorema-theories. Each of these three tools already proved extremely useful in the extensive formal exploration of a non-triv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000